Searching sequence space for protein catalysts
نویسندگان
چکیده
منابع مشابه
Searching in Protein State Space
The increasing complexity of protein interaction networks makes their manual analysis infeasible. Signal transduction processes pose a specific challenge, as each protein can perform different functions, depending on its state. Here, we present a PROLOG and XML based system which explores the protein state space. Starting with state based information about the function of single proteins, the s...
متن کاملNovel use of a genetic algorithm for protein structure prediction: searching template and sequence alignment space.
A novel genetic algorithm was applied to all CASP5 targets. The algorithm simultaneously searches template and alignment space. Results show that the current implementation of the method is perhaps most useful in recognizing and refining remote homology targets. This new method is briefly described and results are analyzed. Strengths and weaknesses of the current implementation of the algorithm...
متن کاملDouble Sequence Iterations for Strongly Contractive Mapping in Modular Space
In this paper, we consider double sequence iteration processes for strongly $rho$-contractive mapping in modular space. It is proved, these sequences, convergence strongly to a fixed point of the strongly $rho$-contractive mapping.
متن کاملSearching for frameshift evolutionary relationships between protein sequence families.
The protein sequence database was analyzed for evidence that some distinct sequence families might be distantly related in evolution by changes in frame of translation. Sequences were compared using special amino acid substitution matrices for the alternate frames of translation. The statistical significance of alignment scores were computed in the true database and shuffled versions of the dat...
متن کاملComparison of methods for searching protein sequence databases.
We have compared commonly used sequence comparison algorithms, scoring matrices, and gap penalties using a method that identifies statistically significant differences in performance. Search sensitivity with either the Smith-Waterman algorithm or FASTA is significantly improved by using modern scoring matrices, such as BLOSUM45-55, and optimized gap penalties instead of the conventional PAM250 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 2001
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.191159298